|
KMID : 1132720120100010051
|
|
Genomics & Informatics
2012 Volume.10 No. 1 p.51 ~ p.57
|
|
|
An Efficient Approach to Mining Maximal Contiguous Frequent Patterns from Large DNA Sequence Databases
|
|
Karim Rezaul
Rashid Mamunur
Jeong Byeong-Soo
Choi Ho-Jin
|
|
|
Abstract
|
|
|
|
Mining interesting patterns from DNA sequences is one of the most challenging tasks in bioinformatics and computational biology. Maximal contiguous frequent patterns are preferable for expressing the function and structure of DNA sequences and hence can capture the common data characteristics among related sequences. Biologists are interested in finding frequent orderly arrangements of motifs that are responsible for similar expression of a group of genes. In order to reduce mining time and complexity, however, most existing sequence mining algorithms either focus on finding short DNA sequences or require explicit specification of sequence lengths in advance. The challenge is to find longer sequences without specifying sequence lengths in advance. In this paper, we propose an efficient approach to mining maximal contiguous frequent patterns from large DNA sequence datasets. The experimental results show that our proposed approach is memory-efficient and mines maximal contiguous frequent patterns within a reasonable time.
|
|
|
KEYWORD
|
|
|
DNA sequence, maximal contiguous frequent pattern, pattern mining, suffix tree
|
|
|
FullTexts / Linksout information
|
|
|
|
|
|
Listed journal information
|
|
 
|